The Vickrey-Target Strategy and the Core in Ascending Combinatorial Auctions
نویسنده
چکیده
This paper considers a general class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. We analyze incentives in ascending combinatorial auctions under complete and perfect information. We show that in every ascending auction, the “Vickrey-target strategy” constitutes a subgame perfect equilibrium with a restricted strategy space. The equilibrium outcome is in the bidder-optimal core and unique under some criteria. This implies equilibrium selection is done by an ascending price scheme from many equilibria of sealed-bid auctions. The equilibrium outcome is “unfair” in the sense that winners with low valuations tend to earn high profits. The payoff non-monotonicity may lead to inefficiency in the equilibrium under unrestricted strategy space. JEL classification: D44, C7
منابع مشابه
Ascending price Vickrey auctions for general valuations
Ascending price auctions typically involve a single price path with buyers paying their final bid price. Using this traditional definition, no ascending price auction can achieve the Vickrey-Clarke-Groves (VCG) outcome for general private valuations in the combinatorial auction setting. We relax this definition by allowing discounts to buyers from the final price of the auction (or alternativel...
متن کاملCore-Implementing Nash Equilibrium in the Vickrey Auction and Some Unstable Mechanisms
This paper demonstrates the Vickrey auction has a Nash equilibrium in the core. Generally, the dominant-strategy-equilibrium outcome of the Vickrey auction is not located in the core. However, a particular profile of truncation strategies is a Nash equilibrium, and it implements an outcome in the bidderoptimal core. The specified strategy profile is identical to that in core-selecting auctions ...
متن کاملAn E¢ cient Multi-Unit Ascending Auction
We provide an ascending auction that yields an e¢ cient outcome when there are many identical units for sale and bidders have interdependent values and downward-sloping demand. Our ascending auction both extends and generalizes Ausubels (1997) and yields the same outcome as Perry and Renys (2002) generalization of Vickreys (1961) sealed-bid auction. There are two key features of our auction....
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملAscending auctions : some impossibility results and their resolutions with final price discounts
When bidders are not substitutes, we show that there is no standard ascending auction that implements a bidder-optimal competitive equilibrium under truthful bidding. Such an impossibility holds also in environments where the Vickrey payoff vector is a competitive equilibrium payoff and is thus stronger than de Vries, Schummer and Vohra’s [On ascending Vickrey auctions for heterogeneous objects...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011